Termination w.r.t. Q of the given QTRS could be disproven:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

b(c(x1)) → a(b(b(x1)))
b(a(x1)) → a(c(b(x1)))

Q is empty.

(1) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:

b c a a c a → a a c a b a c b c a a c a b b b

b c a a c a → a a c a b a c b c a a c a b b b
by OverlapClosure OC 2

b c a a → a a c a b a c b c b
by OverlapClosure OC 3

b c a a → a a c a b b a c b
by OverlapClosure OC 2

b c a → a a c a b b b
by OverlapClosure OC 3

b c a → a a c b c b
by OverlapClosure OC 3

b c a → a b a c b
by OverlapClosure OC 2

b c → a b b
by original rule (OC 1)

b a → a c b
by original rule (OC 1)

b a → a c b
by original rule (OC 1)

b c → a b b
by original rule (OC 1)

b a → a c b
by original rule (OC 1)

b a → a c b
by original rule (OC 1)

b c a → a a c a b b b
by OverlapClosure OC 3

b c a → a a c b c b
by OverlapClosure OC 3

b c a → a b a c b
by OverlapClosure OC 2

b c → a b b
by original rule (OC 1)

b a → a c b
by original rule (OC 1)

b a → a c b
by original rule (OC 1)

b c → a b b
by original rule (OC 1)

(2) NO